Flow network

Results: 2096



#Item
41On the Submodularity of Influence in Social Network

On the Submodularity of Influence in Social Network

Add to Reading List

Source URL: www-scf.usc.edu

Language: English - Date: 2014-07-26 02:03:53
42IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 1, JANUARYImpact of Vehicles as Obstacles in Vehicular Ad Hoc Networks

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 1, JANUARYImpact of Vehicles as Obstacles in Vehicular Ad Hoc Networks

Add to Reading List

Source URL: mateboban.net

Language: English - Date: 2013-07-15 15:56:47
43Distributed ADMM for Model Predictive Control and Congestion Control João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 Abstract— Many problems in control can be modeled as an optimi

Distributed ADMM for Model Predictive Control and Congestion Control João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 Abstract— Many problems in control can be modeled as an optimi

Add to Reading List

Source URL: www.ee.ucl.ac.uk

Language: English - Date: 2013-07-05 07:45:59
44Crossing Network versus Dealer Market: Unique Equilibrium in the Allocation of Order Flow ∗ Jutta D¨onges† and Frank Heinemann‡ March 8, 2006  Abstract

Crossing Network versus Dealer Market: Unique Equilibrium in the Allocation of Order Flow ∗ Jutta D¨onges† and Frank Heinemann‡ March 8, 2006 Abstract

Add to Reading List

Source URL: www.macroeconomics.tu-berlin.de

Language: English - Date: 2008-11-04 18:31:40
45ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal

ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal

Add to Reading List

Source URL: www.ijmetmr.com

Language: English - Date: 2015-01-27 07:14:47
46Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-17 15:32:23
47Time-Dependent Hazardous-materials Network Design Problem Tolou Esfandeh∗a , Rajan Batta†b , and Changhyun Kwon‡c a Optym, Gainesville, FL, USA Department of Industrial and Systems Engineering, University at Buffal

Time-Dependent Hazardous-materials Network Design Problem Tolou Esfandeh∗a , Rajan Batta†b , and Changhyun Kwon‡c a Optym, Gainesville, FL, USA Department of Industrial and Systems Engineering, University at Buffal

Add to Reading List

Source URL: www.chkwon.net

Language: English - Date: 2016-08-04 11:55:32
481  Optimizing Content Dissemination in Vehicular Networks with Radio Heterogeneity Joon Ahn† , Maheswaran Sathiamoorthy† , Bhaskar Krishnamachari† , Fan Bai‡ , Lin Zhang§ † University of Southern California, L

1 Optimizing Content Dissemination in Vehicular Networks with Radio Heterogeneity Joon Ahn† , Maheswaran Sathiamoorthy† , Bhaskar Krishnamachari† , Fan Bai‡ , Lin Zhang§ † University of Southern California, L

Add to Reading List

Source URL: anrg.usc.edu

Language: English - Date: 2013-07-23 10:54:00
49OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
501  Distributed Optimization With Local Domains: Applications in MPC and Network Flows João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

1 Distributed Optimization With Local Domains: Applications in MPC and Network Flows João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

Add to Reading List

Source URL: www.ee.ucl.ac.uk

Language: English - Date: 2015-01-22 05:50:55